Error correction decoder, error correction value generator, and error correction system

ABSTRACT

An error correction decoder includes a syndrome generator and an error correction value generator. The syndrome generator is operable to generate a plurality of syndromes based upon a received signal generated according to a generator polynomial. The error correction value generator is operable to generate a plurality of product values. Each of the product values is generated for one of the syndromes based upon a respective power of the roots of the generator polynomial. The respective power is determined based upon a respective index corresponding to one of the syndromes to be considered and unit positions of the received signal. The error correction value generator is further operable to generate an error correction value according to the product values, and to provide an error correcting device coupled thereto with the error correction value for correcting an error of the received signal.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to an error correction decoder, moreparticularly to an error correction decoder for cyclic codes.

2. Description of the Related Art

Nowadays, development of digital storage technology and communicationtechnology has resulted in relatively high speed of data access andtransmission. However, since transmission media and channels are easilycorrupted by interference during data access and transmission, errordetection and correction has become more and more significant.Generally, error-correcting codes are used in existing satellitecommunication systems, digital televisions, various digital audio-videostorage media, and the like for enhancing reliability of data access andtransmission. In the error-correcting codes, application of a cycliccode is not uncommon.

A conventional error correcting method includes the steps of: receivinga signal; determining a plurality of syndromes based upon the receivedsignal; using Berlekamp-Massey Algorithm to determine an error locatorpolynomial and an error magnitude polynomial based upon the syndromes;performing Chien search with the error locator polynomial and the errormagnitude polynomial to determine at least one error position and anerror correction value corresponding to the error position; andperforming error correction upon the received signal. Theoretical basesof the conventional error correcting method are described in “The Art ofError Correcting, Robert H. et al., 2006” and “Fundamentals ofError-Correcting Codes, W. Cary Huffman and Vera Pless, 2003.”

However, the conventional error correcting method takes relatively moretime and is more complex since it involves complex calculation forobtaining the error locator polynomial and the error magnitudepolynomial and Chien search. The conventional error correcting methodwould not result insignificant problems or time delay in the past sincethe rate of data access and transmission then are relatively low.However, since performance and transmission rate of current computersystems are greatly enhanced, a large number of circuits and anincreased speed for processing data are currently required to completedecoding procedure within a desired time limit. Unfortunately, the costof hardware will increase, and consumed power of the systems will rise.

SUMMARY OF THE INVENTION

Therefore, an object of the present invention is to provide an errorcorrection decoder capable of alleviating the above drawbacks of theprior art.

Accordingly, an error correction decoder of this invention is adapted tobe coupled to an error correcting device for providing the errorcorrecting device with an error correction value to correct an errorcorresponding to an error position of a received signal receivedthereby. The received signal is generated based upon a generatorpolynomial. The error correction decoder comprises a syndrome generatorand an error correction value generator.

The syndrome generator is adapted to receive the received signal, and isoperable to generate a plurality of syndromes based upon the receivedsignal. Each of the syndromes is associated with a respective index.

The error correction value generator is coupled to the syndromegenerator, and is adapted to receive the syndromes therefrom. The errorcorrection value generator includes a first computing module and asecond computing module coupled to the first computing module.

The first computing module is operable to generate a plurality ofproduct values, each of which is generated for one of the syndromesbased upon a respective power of roots of the generator polynomial. Therespective power is determined based upon the respective indexcorresponding to one of the syndromes to be considered and unitpositions of the received signal. The second computing module isoperable to generate the error correction value according to the productvalues obtained by the first computing module, and to provide the errorcorrecting device with the error correction value computed thereby forcorrecting the error of the received signal.

Another object of the present invention is to provide an errorcorrection value generator adapted for use in the above-mentioned errorcorrection decoder according to the present invention.

According to another aspect of this invention, an error correctionsystem is adapted for correcting an error corresponding to an errorposition of a received signal received thereby. The error correctionsystem comprises the above-mentioned error correction decoder and anerror correcting device. The error correcting device is coupled to theerror correction value generator of the error correction decoder, and isadapted to receive the error correction values therefrom. The errorcorrecting device is operable to correct the error of the receivedsignal according to the error correction values.

BRIEF DESCRIPTION OF THE DRAWINGS

Other features and advantages of the present invention will becomeapparent in the following detailed description of the preferredembodiments with reference to the accompanying drawings, of which:

FIG. 1 is a block diagram illustrating a preferred embodiment of anerror correction decoder used in an error correction system according tothe present invention;

FIGS. 2A and 2B are schematic diagrams illustrating a first preferredembodiment of an error correction value generator of the errorcorrection decoder, which includes a first computing module containing amultiplier as shown in FIG. 2A and a second computing module containingan adder as shown in FIG. 2B;

FIG. 3 is a schematic diagram illustrating a second preferred embodimentof the error correction value generator that includes a plurality oftrace mapping operators and an adder; and

FIG. 4 is a schematic diagram illustrating a third preferred embodimentof the error correction value generator that includes a plurality of ANDoperators and a plurality of XOR operators.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring to FIG. 1, a preferred embodiment of an error correctionsystem 10 according to this invention includes an error correctiondecoder 1 and an error correcting device 2 coupled to the errorcorrection decoder 1. A source signal is encoded based upon a generatorpolynomial to generate a cyclic codeword with a length n. Then, thecyclic codeword is transmitted to the error correction system 10 via atransmission channel to result in a received signal received by theerror correction system 10.

Since the cyclic codeword may be corrupted by interference duringtransmission through the transmission channel, the received signal wouldnot be exactly the same as the source signal. The cyclic codeword can beexpressed as a codeword polynomial

${{c(x)} = {\sum\limits_{j = 0}^{n - 1}{c_{j}x^{j}}}},$

where j is unit positions of the received signal and (c₀, c₁, . . . ,c_(n-1)) denotes an associated code vector. Errors of the receivedsignal attributed to the interference can be expressed as an errorpolynomial

${{e(x)} = {\sum\limits_{j = 0}^{n - 1}{e_{j}x^{j}}}},$

where e_(j) is the jth error correction value. Therefore, the receivedsignal can be expressed as

$\begin{matrix}{{r(x)} = {{\sum\limits_{j = 0}^{n - 1}{r_{j}x^{i}}} = {{c(x)} + {{e(x)}.}}}} & (1)\end{matrix}$

The error correction decoder 1 includes a syndrome generator 11 and anerror correction value generator 12 coupled to the syndrome generator11, and is operable to provide the error correcting device 2 with theerror correction values e_(j). According to the error correction valuese_(j), the error correcting device 2 is operable to correct the errorsof the received signal to output a corrected signal corresponding to thecyclic codeword of the source signal. Embodiments and operation of theerror correction decoder 1 and the error correcting device 2 aredescribed in the following.

First, the syndrome generator 11 receives the received signal, and isoperable to generate a plurality of syndromes S_(i), each of which isassociated with a respective index i. The syndromes include at least oneknown syndrome and at least one unknown syndrome. The syndrome generator11 includes a known syndrome generating module 111, and an unknownsyndrome generating module 112 coupled to the known syndrome generatingmodule 111. The known syndrome generating module 111 is operable togenerate the known syndrome based upon the roots β^(i) of the generatorpolynomial and the polynomial r(x) of Equation (1). The unknown syndromegenerating module 112 is operable to generate the unknown syndromeaccording to the known syndrome. Since methods for generating thesyndromes S_(i) are known to those skilled in the art (see, for example,“Algebraic Decoding of (71, 36, 11), (79, 40, 15) and (97, 49, 15)Quadratic Residue Codes,” IEEE Transactions on Communications, Vol. 51,No. 9, pages 1463-1473, September 2003, and “Algebraic Decoding of (103,52, 19) and (113, 57, 15) Quadratic Residue Codes,” IEEE Transactions onCommunications, Vol. 53, No. 5, pages 749-754, May 2005), detailsthereof will be omitted herein for the sake of brevity.

Then, the error correction value generator 12, which includes a firstcomputing module 121 and a second computing module 122, receives thesyndromes S_(i) generated by the syndrome generator 11. For each of theunit positions j of the received signal, the first computing module 121is operable to generate a group of product values that are defined asS_(i)/β^(j·i). The second computing module 122 is coupled to the firstcomputing module 121, and is operable to generate the error correctionvalues e_(j) according to the groups of the product valuesS_(i)/β^(j·i), respectively.

Referring to FIGS. 1, 2A and 2B, in the first preferred embodiment ofthe error correction decoder 1, the first computing module 121 of theerror correction value generator 12 includes a plurality of multipliers123, and the second computing module 122 of the error correction valuegenerator 12 includes an adder 124. Since the roots β^(i) of thegenerator polynomial is a given constant, the first computing module 121uses each of the multipliers 123 that corresponds to one of thesyndromes S_(i) associated with the respective index i to compute aproduct of S_(i) and 1/β^(j·i) to obtain a corresponding one of theproduct values S_(i)/β^(j·i). Then, the adder 124 of the secondcomputing module 124 is operable to generate one of the error correctionvalues e_(j) that corresponds to the jth one of the unit positions ofthe received signal according to

$\begin{matrix}{e_{j} = {\sum\limits_{i = 0}^{n - 1}{\left( \frac{S_{i}}{\beta^{j \cdot i}} \right).}}} & (2)\end{matrix}$

For each of the unit positions j, the error correction value generator12 is operable to generate a corresponding one of the error correctionvalues e_(j).

Referring to FIGS. 1 and 3, in the second preferred embodiment, thesyndrome generator 11 is operable to generate the syndromes S_(i) thatbelong to a set of representative syndromes. The respective index icorresponding to each of the representative element belongs to a set Rof all representatives of a cyclotomic coset C_(i) of i modulo n, i.e.,iεR. Particularly, the cyclotomic coset C_(i) is defined by thefollowing Equation (3),

C _(i) ={i·2^(k) |k=0,1, . . . ,d−1},  (3)

where d is a minimum positive integer satisfying i·2^(d)≡i (mod n). Forfacilitating the following description of the operation of the first andsecond computing modules 121 and 122, Equations (4) to (7) are proposedand explained herein.

F=GF(2)  (4)

E=GF(2^(m))  (5)

K=GF(2^(d))  (6)

In Equations (4) to (6), F is Galois Field GP(2), E is an extensionfield of Galois Field F=GF(2) of degree m, and K is a subfield of E.Moreover, trace mapping values from K onto F can be defined as

Tr _(K/F)(γ)=γ+γ²+ . . . +γ^(2d-1) ,γεK.  (7)

In this embodiment, the first computing module 121 is similar to thefirst preferred embodiment. According to the above description, thefirst computing module 121 uses the multipliers 123 as shown in FIG. 2Ato generate the product values S_(i)/β^(j·i), where iεR. The secondcomputing module 122 includes a plurality of trace mapping operators 125and an adder 126 coupled to the trace mapping operators 125. The tracemapping operators 125 are operable to compute the trace mapping valuesTr_(K/F)(S_(i)/β^(j·i)) of the product values S_(i)/β^(j·i),respectively. In practice, each of the trace mapping operators 125 canbe configured as an adder. Then, the adder 126 is operable to compute asummation of the trace mapping values Tr_(K/F)(S_(i)/β^(j·i)) to obtainone of the error correction values e_(j) according to

$\begin{matrix}{e_{j} = {\sum\limits_{i \in R}{{{Tr}_{K/F}\left( \frac{S_{i}}{\beta^{j \cdot i}} \right)}.}}} & (8)\end{matrix}$

Similarly, for each of the unit positions j, the error correction valuegenerator 12 is operable to generate a corresponding one of the errorcorrection values e_(j).

Referring to FIGS. 1 and 4, in the third preferred embodiment, thesyndrome generator 11 is similar to the second preferred embodiment, andis also operable to generate the syndromes S_(i), where iεR. Theoperation of the second computing module 122 of the error correctionvalue generator 12 can be simplified according to the followingassumption.

It is assumed that (α⁰, α¹, . . . , α^(m-1)) form a basis set ofE=GF(2^(m)). Therefore, a set of trace mapping values can be defined as

c _(k) =Tr _(E/F)(α^(k)).  (9)

Since α⁰ to α^(m-1) are given constants, the set of trace mapping valuesc_(k) can be predetermined and belong to Galois field F, i.e., c_(k) εF.Further, if the roots β^(i) of the generator polynomial belongs to E(βεE), and the product values S_(i)/β^(j·i) can be expressed as

$\begin{matrix}{{\frac{S_{i}}{\beta^{j \cdot i}} = {\sum\limits_{k = 0}^{m - 1}{a_{jk}^{i}\alpha^{k}}}},} & (10)\end{matrix}$

where the coefficient sequence a_(jk) ^(i) belongs to F (a_(jk) ^(i)εF), the error correction value e_(j) corresponding to the jth one ofthe unit positions of the received signal can be further simplified.

The first computing module 121 of the error correction value generator12 is operable to generate the product values S_(i)/β^(j·i), where iεR,and to store the coefficient sequence a_(j0) ^(i) to a_(j(m-1)) ^(i).Then, the second computing module 122 is configured to generate theerror correction value e_(j) according to

$\begin{matrix}{e_{j} = {S_{0} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{i = 1}^{R}{a_{jk}^{i}{c_{k}.}}}}}} & (11)\end{matrix}$

In this embodiment, the second computing module 122 includes a pluralityof AND operators 127 and a plurality of XOR operators 128 configured tocompute the error correction value e_(j). The AND operators 127 areoperable to do multiplication operations of Equation (11), and the XORoperators 128 are operable to do addition operations of Equation (11).

Similarly, for each of the unit positions j, the error correction valuegenerator 12 is operable to generate a corresponding one of the errorcorrection values e_(j).

Finally, according to the error correction values e_(j) and the unitpositions j of the received signal, the error correcting device 2 isoperable to correct the errors of the received signal to output thecorrected signal corresponding to the cyclic codeword of the sourcesignal. When any of the error correction values e_(j) is not equal to 0,this means that the received signal is corrupted and requirescorrection. Then, the error correcting device 2 is operable to generatethe error polynomial

${e(x)} = {\sum\limits_{j = 0}^{n - 1}{e_{j}x^{j}}}$

for correcting the errors of the received signal according to

c(x)=r(x)−e(x).  (12)

To sum up, after obtaining the required syndromes, the first and secondcomputing modules 121 and 122 of this invention are operable to generatethe error correction values e_(j) according to relatively easieroperation and circuits without using Chien search and complexcalculation for obtaining an error locator polynomial and an errormagnitude polynomial. Therefore, the objects of the present inventioncan be certainly achieved.

While the present invention has been described in connection with whatare considered the most practical and preferred embodiments, it isunderstood that this invention is not limited to the disclosedembodiments but is intended to cover various arrangements includedwithin the spirit and scope of the broadest interpretation so as toencompass all such modifications and equivalent arrangements.

1. An error correction decoder adapted to be coupled to an errorcorrecting device for providing the error correcting device with anerror correction value to correct an error corresponding to an errorposition of a received signal received thereby, the received signalbeing generated based upon a generator polynomial, said error correctiondecoder comprising: a syndrome generator adapted to receive the receivedsignal, and operable to generate a plurality of syndromes based upon thereceived signal, each of the syndromes being associated with arespective index; and an error correction value generator coupled tosaid syndrome generator and adapted to receive the syndromes therefrom,said error correction value generator including a first computing moduleoperable to generate a plurality of product values, each of which isgenerated for one of the syndromes based upon a respective power ofroots of the generator polynomial, the respective power being determinedbased upon the respective index corresponding to one of the syndromes tobe considered and unit positions of the received signal, and a secondcomputing module coupled to said first computing module, said secondcomputing module being operable to generate the error correction valueaccording to the product values obtained by said first computing module,and to provide the error correcting device with the error correctionvalue computed thereby for correcting the error of the received signal.2. The error correction decoder as claimed in claim 1, wherein thesyndromes generated by said syndrome generator include at least oneknown syndrome and at least one unknown syndrome, and said syndromegenerator is operable to generate the known syndrome based upon apolynomial associated with the received signal and to generate theunknown syndrome according to the known syndrome.
 3. The errorcorrection decoder as claimed in claim 1, wherein said first computingmodule is operable to divide each of the syndromes by the respectivepower of the roots of the generator polynomial to obtain the productvalues.
 4. The error correction decoder as claimed in claim 1, wherein,for each of the syndromes, the product value generated by said firstcomputing module of said error correction value generator is equal toS_(i)/β^(j·i). where S_(i) is one of the syndromes associated with therespective index i, j denotes the unit position of the received signal,and β^(i) are the roots of the generator polynomial.
 5. The errorcorrection decoder as claimed in claim 4, wherein said first computingmodule of said error correction value generator includes a multiplieroperable to compute a product of S_(i) and 1/β^(j·i) to obtain acorresponding one of the product values S_(i)/β^(j·i).
 6. The errorcorrection decoder as claimed in claim 4, a source signal being encodedbased upon the generator polynomial to generate a cyclic codeword with alength n, the cyclic codeword being transmitted to said error correctiondecoder via a transmission channel to result in the received signal,wherein the error correction value is generated by said second computingmodule of said error correction value generator according to${e_{j} = {\sum\limits_{i = 0}^{n - 1}\left( \frac{S_{i}}{\beta^{j \cdot i}} \right)}},$where e_(j) is the error correction value.
 7. The error correctiondecoder as claimed in claim 4, a source signal being encoded based uponthe generator polynomial to generate a cyclic codeword with a length n,the cyclic codeword being transmitted to said error correction decodervia a transmission channel to result in the received signal, wherein thesyndromes generated by said syndrome generator belong to a set ofrepresentative syndromes, and the respective index corresponding to eachof the syndromes belongs to a set of all representatives of a cyclotomiccoset of i modulo n.
 8. The error correction decoder as claimed in claim7, wherein said second computing module of said error correction valuegenerator is operable to compute a plurality of trace mapping valuesTr_(K/F)(S_(i)/β^(j·i)), each of which corresponds to one of the productvalues, and to compute a summation of the trace mapping values to obtainthe error correction value according to${e_{j} = {\sum\limits_{i \in R}{{Tr}_{K/F}\left( \frac{S_{i}}{\beta^{j \cdot i}} \right)}}},$where e_(j) is the error correction value, R is the set of allrepresentatives of the cyclotomic coset of i modulo n, F is Galois fieldGF(2), K is Galois field GF(2^(d)), and d is a minimum positive integersatisfying i·2d≡i (mod n).
 9. The error correction decoder as claimed inclaim 7, the roots of the generator polynomial belonging to E=GF(2^(m))being an extension field of Galois field F=GF(2) of degree m, wherein:said first computing module further generates a coefficient sequencea_(j0) ^(i) to a_(j(m-1)) ^(i) according to${\frac{S_{i}}{\beta^{j \cdot i}} = {\sum\limits_{k = 0}^{m - 1}{a_{jk}^{i}\alpha^{k}}}},$where a_(j0) ^(i) to a_((m-1)) ^(i) belong to Galois field F, and (α⁰,α¹, . . . , α^(m-1)) form a basis set of E; and the error correctionvalue is generated by said second computing module of said errorcorrection value generator according to${e_{j} = {S_{0} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{i = 1}^{R}{a_{jk}^{i}c_{k}}}}}},$where e_(j) is the error correction value, and c₀ to c_(m-1) arepredetermined according to the basis set of E and belong to Galois fieldF.
 10. The error correction decoder as claimed in claim 9, wherein saidsecond computing module includes a plurality of AND operators and aplurality of XOR operators configured to compute the error correctionvalue.
 11. An error correction value generator adapted for use in anerror correction decoder that is coupled to an error correcting devicefor providing the error correcting device with an error correction valueto correct an error corresponding to an error position of a receivedsignal received by the error correction decoder, and that includes asyndrome generator operable to generate a plurality of syndromes basedupon the received signal, each of the syndromes being associated with arespective index, the received signal being generated based upon agenerator polynomial, said error correction value generator beingadapted to be coupled to the syndrome generator for receiving thesyndromes therefrom, and comprising: a first computing module operableto generate a plurality of product values, each of which is generatedfor one of the syndromes based upon a respective power of roots of thegenerator polynomial, the respective power being determined based uponthe respective index corresponding to one of the syndromes to beconsidered and unit positions of the received signal; and a secondcomputing module coupled to said first computing module, said secondcomputing module being operable to generate the error correction valueaccording to the product values obtained by said first computing module,and to provide the error correcting device with the error correctionvalue computed thereby for correcting the error of the received signal.12. The error correction value generator as claimed in claim 11, whereinsaid first computing module is operable to divide each of the syndromesby the respective power of the roots of the generator polynomial toobtain the product values.
 13. The error correction value generator asclaimed in claim 11, wherein, for each of the syndromes, the productvalue generated by said first computing module is equal toS_(i)/β^(j·i), where S_(i) is one of the syndromes associated with therespective index i, j is the unit position of the received signal, andβ^(i) are the roots of the generator polynomial.
 14. The errorcorrection value generator as claimed in claim 13, wherein said firstcomputing module includes a multiplier operable to compute a product ofS_(i) and 1/β^(j·i) to obtain a corresponding one of the product valuesS_(i)/β^(j·i).
 15. The error correction value generator as claimed inclaim 13, a source signal being encoded based upon the generatorpolynomial to generate a cyclic codeword with a length n, the cycliccodeword being transmitted to the error correction decoder via atransmission channel to result in the received signal, wherein the errorcorrection value is generated by said second computing module accordingto${e_{j} = {\sum\limits_{i = 0}^{n - 1}\left( \frac{S_{i}}{\beta^{j \cdot i}} \right)}},$where e_(j) is the error correction value.
 16. The error correctionvalue generator as claimed in claim 13, a source signal being encodedbased upon the generator polynomial to generate a cyclic codeword with alength n, the cyclic codeword being transmitted to the error correctiondecoder via a transmission channel to result in the received signal,wherein said first computing module generates the product values foreach of the syndromes belonging to a set of representative syndromes,and the respective index corresponding to each of the syndromes belongsto a set of all representatives of a cyclotomic coset of i modulo n. 17.The error correction value generator as claimed in claim 16, whereinsaid second computing module is operable to compute a plurality of tracemapping values Tr_(K/F)(S_(i)/β^(j·i)), each of which corresponds to oneof the product values, and to compute a summation of the trace mappingvalues to obtain the error correction value according to${e_{j} = {\sum\limits_{i \in R}{{Tr}_{K/F}\left( \frac{S_{i}}{\beta^{j \cdot i}} \right)}}},$where e_(j) is the error correction value, R is the set of allrepresentatives of the cyclotomic coset of i modulo n, F is Galois fieldGF(2), K is Galois field GF(2^(d)), and d is a minimum positive integersatisfying i·2^(d)≡i (mod n).
 18. The error correction value generatoras claimed in claim 16, the roots of generator polynomial belonging toE=GF(2^(m)) being an extension field of Galois field F=GF(2) of degreem, wherein: said first computing module further generates a coefficientsequence a_(j0) ^(i), to a_(j(m-1)) ^(i) according to${\frac{S_{i}}{\beta^{j \cdot i}} = {\sum\limits_{k = 0}^{m - 1}{a_{jk}^{i}\alpha^{k}}}},$where a_(j0) ^(i) to a_(j(m-1)) ^(i) belong to Galois field F, and (α⁰,α¹, . . . , α^(m-1)) form a basis set of E; and the error correctionvalue is generated by said second computing module according to${e_{j} = {S_{0} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{i = 1}^{{R}}{a_{jk}^{i}c_{k}}}}}},$where e_(j) is the error correction value, and c₀ to c_(m-1) arepredetermined according to the basis set of E and belong to Galois fieldF.
 19. The error correction value generator as claimed in claim 18,wherein said second computing module includes a plurality of ANDoperators and a plurality of XOR operators configured to compute theerror correction value.
 20. An error correction system adapted forcorrecting an error corresponding to an error position of a receivedsignal received thereby, the received signal being generated based upona generator polynomial, said error correction system comprising: anerror correction decoder including a syndrome generator adapted toreceive the received signal, and operable to generate a plurality ofsyndromes based upon the received signal, each of the syndromes beingassociated with a respective index, and an error correction valuegenerator coupled to said syndrome generator and being operable togenerate a plurality of error correction values according to thesyndromes received from said syndrome generator; and an error correctingdevice coupled to said error correction value generator and adapted toreceive the error correction values therefrom, said error correctingdevice being operable to correct the error of the received signalaccording to the error correction values; wherein said error correctionvalue generator of said error correction decoder includes a firstcomputing module being operable to generate a group of product valuesfor each of unit positions of the received signal, each of the productvalues of the same group being generated based upon one of the syndromesand a respective power of roots of the generator polynomial, therespective power being determined based upon the respective indexcorresponding to one of the syndromes to be considered and thecorresponding one of the unit positions, and a second computing modulecoupled to said first computing module, and being operable to generatethe error correction values according to the groups of the productvalues, respectively.
 21. The error correction system as claimed inclaim 20, wherein said error correcting device is operable to generatean error polynomial according to the error correction values that serveas coefficients of the error polynomial, and to correct the error of thereceived signal according to the error polynomial.
 22. The errorcorrection system as claimed in claim 20, wherein the syndromesgenerated by said syndrome generator include at least one known syndromeand at least one unknown syndrome, and said syndrome generator isoperable to generate the known syndrome based upon a polynomialassociated with the received signal and to generate the unknown syndromeaccording to the known syndrome.
 23. The error correction system asclaimed in claim 20, wherein said first computing module is operable todivide each of the syndromes by the respective power of the roots of thegenerator polynomial to obtain the product values.
 24. The errorcorrection system as claimed in claim 20, wherein, for each of thesyndromes, the product value generated by said first computing module ofsaid error correction value generator is equal to S_(i)/β^(j·i), whereS_(i) is one of the syndromes associated with the respective index i, jis the unit position of the received signal, and β^(i) are the roots ofthe generator polynomial.